Determinant Representations of Polynomial Sequences of Riordan Type
نویسندگان
چکیده
منابع مشابه
The Characterization of Riordan Arrays and Sheffer-type Polynomial Sequences
Here we present a characterization of Sheffer-type polynomial sequences based on the isomorphism between the Riordan group and Sheffer group and the sequence characterization of Riordan arrays. We also give several alternative forms of the characterization of the Riordan group, Sheffer group and their subgroups. Formulas for the computation of the generating functions of Riordan arrays and Shef...
متن کاملCharacterization of (c)-Riordan Arrays, Gegenbauer-Humbert-type polynomial sequences, and (c)-Bell polynomials
Here presented are the definitions of (c)-Riordan arrays and (c)-Bell polynomials which are extensions of the classical Riordan arrays and Bell polynomials. The characterization of (c)-Riordan arrays by means of the Aand Z-sequences is given, which corresponds to a horizontal construction of a (c)Riordan array rather than its definition approach through column generating functions. There exists...
متن کاملRecurrence Relations for Polynomial Sequences via Riordan Matrices
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan matrices to interpret some relationships between different families of polynomials. Moreover using the Hadamard product of series we get a general recurrence ...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولComplexity of the Bollobás-Riordan Polynomial
The coloured Tutte polynomial by Bollobás and Riordan is, as a generalisation of the Tutte polynomial, the most general graph polynomial for coloured graphs that satisfies certain contractiondeletion identities. Jaeger, Vertigan, and Welsh showed that the classical Tutte polynomial is #P-hard to evaluate almost everywhere by establishing reductions along curves and lines. We establish a similar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Mathematics
سال: 2013
ISSN: 2090-9837,2090-9845
DOI: 10.1155/2013/734836